Erratum: The Stable Allocation (or Ordinal Transportation) Problem
نویسندگان
چکیده
منابع مشابه
The Generalized Stable Allocation Problem
We introduce and study the generalized stable allocation problem, an “ordinal” variant of the well-studied generalized assignment problem in which we seek a fractional assignment that is stable (in the same sense as in the classical stable marriage problem) with respect to a two-sided set of ranked preference lists. We develop an O(m logn) algorithm for solving this problem in a bipartite assig...
متن کاملIntegral Stable Allocation Problem on Graphs
As a generalisation of the stable matching problem Bäıou and Balinski [3] defined the stable allocation problem for bipartite graphs, where both the edges and the vertices may have capacities. They constructed a so-called inductive algorithm, that always finds a stable allocation in strongly polynomial time. Here, we generalise their algorithm for non-bipartite graphs with integral capacities. ...
متن کاملThe Problem of Optimal Asset Allocation with Stable Distributed Returns
This paper discusses two optimal allocation problems. We consider different hypotheses of portfolio selection with stable distributed returns for each of them. In particular, we study the optimal allocation between a riskless return and risky stable distributed returns. Furthermore, we examine and compare the optimal allocation obtained with the Gaussian and the stable non-Gaussian distribution...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2002
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.27.4.662.302